A Coherence-Based Algorithm for Optimizing Rank-1 Grassmannian Codebooks
نویسندگان
چکیده
منابع مشابه
Low Rank Vector Bundles on the Grassmannian G(1, 4)
Here we define the concept of L-regularity for coherent sheaves on the Grassmannian G(1, 4) as a generalization of Castelnuovo-Mumford regularity on Pn. In this setting we prove analogs of some classical properties. We use our notion of L-regularity in order to prove a splitting criterion for rank 2 vector bundles with only a finite number of vanishing conditions. In the second part we give the...
متن کاملA Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies on structuring and ordering properties of a binary split algorithm used for codebook design. A simple algorithm is presented for automatic ordering of the codebook entries in order to group similar codevectors. This s...
متن کاملSpeaker Transformation Algorithm using Segmental Codebooks (STASC)
This paper presents a new voice conversion algorithm which modi®es the utterance of a source speaker to sound-like speech from a target speaker. We refer to the method as Speaker Transformation Algorithm using Segmental Codebooks (STASC). A novel method is proposed which ®nds accurate alignments between source and target speaker utterances. Using the alignments, source speaker acoustic characte...
متن کاملRank-Based Evolutionary Algorithm For Structural Optimization
An evolutionary algorithm that utilizes a-priori problem specific information and allows intuitive representation of the problem design variables is proposed. A technique for conditioning the components of the fitness statement using ranking and a graphical method for monitoring components of the rank based fitness function are presented. By utilizing generationally dependant non-linear rank ba...
متن کاملA hybrid GA-TLBO algorithm for optimizing a capacitated three-stage supply chain network
A teaching-learning-based optimization (TLBO) algorithm is a new population-based algorithm applied in some applications in the literature successfully. Moreover, a genetic algorithm (GA) is a popular tool employed widely in many disciplines of engineering. In this paper, a hybrid GA-TLBO algorithm is proposed for the capacitated three-stage supply chain network design (SCND) problem. The SCND ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2017
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2017.2690466